Montgomery-Suitable Cryptosystems
نویسندگان
چکیده
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A,B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is obtained by Mn(Mn(A,B), N −2 mod n) but in this article, we introduce an alternative approach consisting in pre-integrating N into cryptographic keys so that a single Mn(·, ·) will replace directly each modular multiplication. Except the advantage of halving the number of Montgomery multiplications, our strategy skips the pre-calculation (and the storage) of the constant N mod n and reveals to be particularly efficient when a hardware device implementing Mn(·, ·) is the basic computational tool at one’s command.
منابع مشابه
Optimal Use of Montgomery Multiplication on Smart Cards
Montgomery multiplication is used to speed up modular multiplications involved in public-key cryptosystems. However, it requires conversion of parameters into N -residue representation. These additional pre-computations can be costly for low resource devices like smart cards. In this paper, we propose a new, more efficient method, suitable for smart card implementations of most of public-key cr...
متن کاملAre coarse grain reconfigurable architectures suitable for cryptography?
Cryptographic algorithms are increasingly used in personal transaction through Internet network, smart card and telecommunication applications. Those algorithms are well known for their high complexity data computing. This paper focuses on Montgomery algorithm, which computes modular multiplication efficiently. This operation is the most time consuming part of public-key cryptosystems. A compar...
متن کاملHardware Implementation of an Elliptic Curve Processor over GF(p)
This paper describes a hardware implementation of an arithmetic processor which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptography (PKC), i.e., Elliptic Curve (EC) and RSA Cryptosystems. Montgomery modular multiplication in a systolic array architecture is used for modular multiplication. The processor consists of special operational blocks for Montgom...
متن کاملFPGA Implementation of Modified Montgomery for RSA Cryptosystem
Modular multiplication is a key operation in public key cryptosystems like RSA. Among modular multiplication methods, Montgomery modular multiplication is an efficient algorithm suitable for hardware implementation. In this paper, a Modified Montgomery Modular Multiplication design is proposed with carry save adder architecture and parallel simplified quotient computation for the next iteration...
متن کاملLook-Up Table-based Montgomery Algorithm in GF(2k) for Public-Key Cryptosystem
The current paper presents a fast implementation of finite field multiplication, squaring, and exponentiation operations using two look-up tables, thereby reducing the number of operations, saving time through precomputation, and avoiding the complicated computations required in the Montgomery method. Furthermore, look-up table-based algorithms have the advantage of speed and are particularly s...
متن کاملSpeeding Up Barrett and Montgomery Modular Multiplications
This paper proposes two improved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable for hardware implementations. Four large sets of moduli for which the proposed methods apply are given and analyzed from a security point of view. By considering state of art the attacks on public-key cryptosystems, we prove that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993